Lazy Completion of a Partial Orderto the Smallest
نویسندگان
چکیده
Lattice structures are often used in knowledge processing, but starting from a partial order, completion into a lattice poses eeciency problems. We use some recent results on lattice theory to propose an on-line algorithm for eeciently computing of the smallest lattice containing a given partial order, called the Dedekind-MacNeille completion. By on-line we mean that the elements are added if necessary when we compute the greatest lower bound or the least upper bound of two elements that do not already exist. This result can be used in knowledge processing for maintaining the hierarchy of types in an on-line fashion.
منابع مشابه
Making Markov chains less lazy
The mixing time of an ergodic, reversible Markov chain can be bounded in terms of the eigenvalues of the chain: specifically, the second-largest eigenvalue and the smallest eigenvalue. It has become standard to focus only on the secondlargest eigenvalue, by making the Markov chain “lazy”. (A lazy chain does nothing at each step with probability at least 1 2 , and has only nonnegative eigenvalue...
متن کاملA New Approach to Approximate Completion Time Distribution Function of Stochastic Pert Networks
The classical PERT approach uses the path with the largest expected duration as the critical path to estimate the probability of completing a network by a given deadline. However, in general, such a path is not the most critical path (MCP) and does not have the smallest estimate for the probability of completion time. The main idea of this paper is derived from the domination structure between ...
متن کاملSquirrelJoin: Network-Aware Distributed Join Processing with Lazy Partitioning
To execute distributed joins in parallel on compute clusters, systems partition and exchange data records between workers. With large datasets, workers spend a considerable amount of time transferring data over the network. When compute clusters are shared among multiple applications, workers must compete for network bandwidth with other applications. These variances in the available network ba...
متن کاملLazy Evaluation Schemes for Efficient Implementation of Multi-Context Algebraic Completion System
Lazy evaluation is a computational scheme which delays the evaluation of an expression until its value is needed, trying to improve the performance particularly when dealing with large data structure. In this paper, we apply this mechanism to a multi-context algebraic reasoning system which, on a large data structure called the nodes, efficiently simulates parallel processes each executing an a...
متن کاملWell-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in such a way that the new constraint problem G is well-constrained and the set of equations to be solved simultaneously in order to solve G has the smallest size. We propose a polynomial time algorithm which gives a partia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997